Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
نویسندگان
چکیده
In this paper we study the problem of existence of a crossing-free acyclic hamiltonian path completion (for short, HP-completion) set for embedded upward planar digraphs. In the context of book embeddings, this question becomes: given an embedded upward planar digraph G, determine whether there exists an upward 2-page book embedding of G preserving the given planar embedding. Given an embedded st-digraph G which has a crossing-free HP-completion set, we show that there always exists a crossing-free HP-completion set with at most two edges per face of G. For an embedded N-free upward planar digraph G, we show that there always exists a crossing-free acyclic HP-completion set for G which, moreover, can be computed in linear time. For a width-k embedded planar st-digraph G, we show that we can be efficiently test whether G admits a crossing-free acyclic HP-completion set.
منابع مشابه
Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings)
Given an embedded planar acyclic digraph G, we define the problem of"acyclic hamiltonian path completion with crossing minimization (Acyclic-HPCCM)"to be the problem of determining an hamiltonian path completion set of edges such that, when these edges are embedded on G, they create the smallest possible number of edge crossings and turn G to a hamiltonian digraph. Our results include: --We pro...
متن کاملCrossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
Given an embedded planar acyclic digraph G, we define the problem of acyclic hamiltonian path completion with crossing minimization (Acyclic-HPCCM) to be the problem of determining a hamiltonian path completion set of edges such that, when these edges are embedded on G, they create the smallest possible number of edge crossings and turn G to an acyclic hamiltonian digraph. Our results include: ...
متن کاملCrossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
Given an embedded planar acyclic digraph G, the acyclic hamiltonian path completion with crossing minimization (AcyclicHPCCM) problem is to determine a hamiltonian path completion set of edges such that, when these edges are embedded on G, they create the smallest possible number of edge crossings and turn G to a hamiltonian acyclic digraph. In this paper, we present a linear time algorithm whi...
متن کاملSpine Crossing Minimization in Upward Topological Book Embeddings
An upward topological book embedding of a planar st-digraph G is an upward planar drawing of G such that its vertices are aligned along the vertical line, called the spine, and each edge is represented as a simple Jordan curve which is divided by the intersections with the spine (spine crossings) into segments such that any two consecutive segments are located at opposite sides of the spine. Wh...
متن کاملPaths and cycles in extended and decomposable digraphs,
We consider digraphs – called extended locally semicomplete digraphs, or extended LSD’s, for short – that can be obtained from locally semicomplete digraphs by substituting independent sets for vertices. We characterize Hamiltonian extended LSD’s as well as extended LSD’s containing Hamiltonian paths. These results as well as some additional ones imply polynomial algorithms for finding a longes...
متن کامل